Efficiency in Euclidean constrained location problems

Efficiency Constrained Bias Robust Estimation of Location

Equity-Efficiency Bicriteria Location with Squared Euclidean Distances

A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facility distances, as measured by the sum of the absolute differences between all pairs of squared Euclidean distances from inhabitants to the facility. This measure meets the Pigou-Dalton condition of transfers, and can e...

Solving Constrained Two-facility Location Problems

A general approach to optimally solve multiple facility location problems based on the “Big Triangle Small Triangle” approach to solving single facility problems is proposed. The proposed procedure is especially effective when the solution is constrained to a given polygon such as the convex hull of demand points. The procedure is tested on the two facilities Weber problem with attraction and r...

A Compact Linearisation of Euclidean Single Allocation Hub Location Problems

Hub location problems are strategic network planning problems. They formalise the challenge of mutually exchanging shipments between a large set of depots. The aim is to choose a set of hubs (out of a given set of possible hubs) and connect every depot to a hub so that the total transport costs for exchanging shipments between the depots are minimised. In classical hub location problems, the un...

Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems